New Interpretation and Generalization of the Kameda-Weiner Method
نویسنده
چکیده
We present a reinterpretation of the Kameda-Weiner method of finding a minimal nondeterministic finite automaton (NFA) of a language, in terms of atoms of the language. We introduce a method to generate NFAs from a set of languages, and show that the Kameda-Weiner method is a special case of it. Our method provides a unified view of the construction of several known NFAs, including the canonical residual finite state automaton and the atomaton of the language. 1998 ACM Subject Classification F.1.1 Models of Computation
منابع مشابه
A New Generalization of the Gompertz distribution
In this paper, a new distribution of the three-parameter lifetime model called the Marshall-Olkin Gompertz is proposed on the basis of the Gompertz distribution. It is a generalization of the Gompertz distribution having decreasing failure rate and can also be increasing and bathtub-shaped depending on its parameters. The probability density function, cumulative distribution function,...
متن کاملThe Structural Interpretation of the Surah Al-Bayyina through Explaining the Rules of the Structural Interpretation Method of the Surahs of the Qur'an
One of the new methods in the interpretation of the holy Qur'an is structural interpretation that has recently been given special attention. The method of structural interpretation is based on the theory of purposefulness of the Quran's Surahs. In order to provide a structural interpretation of a Surah, two steps should be taken; first, according to the scientific rules, it is necessary to disc...
متن کاملThe Theological Foundations of Subjectvize Interpretation
The Quran is the most authentic and reliable everlasting document of Islam. The popular method for attaining such Quranic teachings is to appeal to successive interpretation of the Quran according to which the Quranic chapters and verses are interpretated on the basis of the present arrangement. But everyone know that his method inspite of its positive points suffers from certain shortcomings. ...
متن کاملLocal Search Heuristics for NFA State Minimization Problem
In the present paper we introduce new heuristic methods for the state minimization of nondeterministic finite automata. These methods are based on the classical Kameda-Weiner algorithm joined with local search heuristics, such as stochastic hill climbing and simulated annealing. The description of the proposed methods is given and the results of the numerical experiments are provided.
متن کاملAn Ensemble Classification Model for the Diagnosis of Breast Cancer Using Stacked Generalization
Introduction: Breast cancer is one of the most common types of cancer whose incidence has increased dramatically in recent years. In order to diagnose this disease, many parameters must be taken into consideration and mistakes are possible due to human errors or environmental factors. For this reason, in recent decades, Artificial Intelligence has been used by medical practitioners to diagnose ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016